Batch processor sharing with hyper-exponential service time
نویسندگان
چکیده
منابع مشابه
Batch processor sharing with hyper-exponential service time
We study the Processor-Sharing queueing model with a hyper-exponential service time distribution and Poisson batch arrival process. In the case of the hyperexponential service time distribution we find an analytical expression for the expected conditional response time function and obtain an alternative proof of its concavity with respect to the service time.
متن کاملBatch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling
We analyze a Processor-Sharing queue with Batch arrivals. Our analysis is based on the integral equation derived by Kleinrock, Muntz and Rodemich. Using the contraction mapping principle, we demonstrate the existence and uniqueness of a solution to the integral equation. Then we provide asymptotical analysis as well as tight bounds for the expected response time conditioned on the service time....
متن کاملSojourn time distributions and time scale separation results for multiclass state-dependent processor sharing systems with a finite service pool and exponential service requirements
The paper addresses multiclass processor sharing systems with general state-dependent service rates, exponential service requirements and a finite service pool. By considering the amount of service received by a permanent customer and associating this service with the evolution of a Markov Reward process, the sojourn time distribution is formulated in terms of a matrix exponential expression. W...
متن کاملAn Equivalent Random Method with hyper-exponential service
The Equivalent Random Method (ERM) has been widely used to predict blocking probabilities at overflow service stations. The method assumes that service times follow an exponential distribution. While this may be a reasonable assumption for voice traffic, it is not a good assumption for dial-up Internet traffic, where service times typically have a coefficient of variation (standard deviation/me...
متن کاملProcessor-sharing and Random-service Queues with Semi-markovian Arrivals
We consider single-server queues with exponentially distributed service times, in which the arrival process is governed by a semi-Markov process (SMP). Two service disciplines, processor sharing (PS) and random service (RS), are investigated. We note that the sojourn time distribution of a type-l customer who, upon his arrival, meets k customers already present in the SMP/M/1/PS queue is identi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2008
ISSN: 0167-6377
DOI: 10.1016/j.orl.2007.11.003